Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars
Identifieur interne : 009257 ( Main/Exploration ); précédent : 009256; suivant : 009258Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars
Auteurs : Jens Michaelis [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: The type of a minimalist grammar (MG) as introduced by Stabler [11,12] provides an attempt of a rigorous algebraic formalization of the new perspectives adopted within the linguistic framework of transformational grammar due to the change from GB-theory to minimalism. Michaelis [6] has shown that MGs constitute a subclass of mildly context-sensitive grammars in the sense that for each MG there is a weakly equivalent linear context-free rewriting system (LCFRS). However, it has been left open in [6], whether the respective classes of string languages derivable by MGs and LCFRSs coincide. This paper completes the picture by showing that MGs in the sense of [11] and LCFRSs give in fact rise to the same class of derivable string languages.
Url:
DOI: 10.1007/3-540-48199-0_14
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002A61
- to stream Istex, to step Curation: 002A24
- to stream Istex, to step Checkpoint: 001D98
- to stream Main, to step Merge: 009778
- to stream Main, to step Curation: 009257
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars</title><author><name sortKey="Michaelis, Jens" sort="Michaelis, Jens" uniqKey="Michaelis J" first="Jens" last="Michaelis">Jens Michaelis</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B3B1AAE3D3E4CACADC8CC8BB9557E6D988602F4B</idno><date when="2001" year="2001">2001</date><idno type="doi">10.1007/3-540-48199-0_14</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-C1LKJC1L-5/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002A61</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002A61</idno><idno type="wicri:Area/Istex/Curation">002A24</idno><idno type="wicri:Area/Istex/Checkpoint">001D98</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001D98</idno><idno type="wicri:doubleKey">0302-9743:2001:Michaelis J:transforming:linear:context</idno><idno type="wicri:Area/Main/Merge">009778</idno><idno type="wicri:Area/Main/Curation">009257</idno><idno type="wicri:Area/Main/Exploration">009257</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars</title><author><name sortKey="Michaelis, Jens" sort="Michaelis, Jens" uniqKey="Michaelis J" first="Jens" last="Michaelis">Jens Michaelis</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Institut für Linguistik, Universität Potsdam, PF 601553, 14415, Potsdam</wicri:regionArea><placeName><region type="land" nuts="2">Brandebourg</region><settlement type="city">Potsdam</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The type of a minimalist grammar (MG) as introduced by Stabler [11,12] provides an attempt of a rigorous algebraic formalization of the new perspectives adopted within the linguistic framework of transformational grammar due to the change from GB-theory to minimalism. Michaelis [6] has shown that MGs constitute a subclass of mildly context-sensitive grammars in the sense that for each MG there is a weakly equivalent linear context-free rewriting system (LCFRS). However, it has been left open in [6], whether the respective classes of string languages derivable by MGs and LCFRSs coincide. This paper completes the picture by showing that MGs in the sense of [11] and LCFRSs give in fact rise to the same class of derivable string languages.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Brandebourg</li></region><settlement><li>Potsdam</li></settlement></list><tree><country name="Allemagne"><region name="Brandebourg"><name sortKey="Michaelis, Jens" sort="Michaelis, Jens" uniqKey="Michaelis J" first="Jens" last="Michaelis">Jens Michaelis</name></region><name sortKey="Michaelis, Jens" sort="Michaelis, Jens" uniqKey="Michaelis J" first="Jens" last="Michaelis">Jens Michaelis</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 009257 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 009257 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:B3B1AAE3D3E4CACADC8CC8BB9557E6D988602F4B
|texte= Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars
}}
| This area was generated with Dilib version V0.6.33. |  |